Generalized Finiteness Conditions of Labelled Transition Systems

A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image compact respectively Some topological properties of the operational semantic models and the so called higher order transformations induced by labelled transition systems satisfying one of the niteness conditions are discussed These results are generalized for metric labelled transition systems satisfying one of the generalized niteness conditions The generalized results are shown to be useful for studying semantics of programming languages For example a proof principle for relating di erent semantic models for a given language based on the results is presented AMS Subject Classi cation Q CR Subject Classi cation D F